Probabilistic Termination
نویسندگان
چکیده
منابع مشابه
Probabilistic Termination Versus Fair Termination
In this paper we show that probabilistic termination of concurrent program is in many cases much simpler than the "f~" one. For a wide class of definitions of probabilistic termination we may express termination by rrf arithmetic formula, whereas the "fair" termination can be expressed only by rrf secqnd order arithmetic formula. Proof of "fair" termination usually needs induction on recursive ...
متن کاملProbabilistic Termination in B
The B Method [1] does not currently handle probability. We add it in a limited form, concentrating on “almost-certain” properties which hold with probability one; and we address briefly the implied modifications to the programs that support B. The Generalised Substitution Language is extended with a binary operator ⊕ representing “abstract probabilistic choice”, so that the substitution prog1 ⊕...
متن کاملProbabilistic Termination of CHRiSM Programs
Termination analysis has received considerable attention in Logic Programming for several decades. In recent years, probabilistic extensions of Logic Programming languages have become increasingly important. Languages like PRISM, CP-Logic, ProbLog and CHRiSM have been introduced and proved very useful for addressing problems in which a combination of logical and probabilistic reasoning is requi...
متن کاملTermination of Nondeterministic Recursive Probabilistic Programs
We study the termination problem for nondeterministic recursive probabilistic programs. First, we show that a ranking-supermartingales-based approach is both sound and complete for bounded terminiation (i.e., bounded expected termination time over all schedulers). Our result also clarifies previous results which claimed that ranking supermartingales are not a complete approach even for nondeter...
متن کاملTermination Analysis of Probabilistic Programs Through Positivstellensatz's
We consider nondeterministic probabilistic programs with the most basic liveness property of termination. We present efficient methods for termination analysis of nondeterministic probabilistic programs with polynomial guards and assignments. Our approach is through synthesis of polynomial ranking supermartingales, that on one hand significantly generalizes linear ranking supermartingales and o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2015
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2775051.2677001